Straight line embeddings of cubic planar graphs with integer edge lengths
نویسندگان
چکیده
We prove that every simple cubic planar graph admits a planar embedding such that each edge is embedded as a straight line segment of integer length. © 2008 Wiley Periodicals, Inc. J Graph Theory 58: 270–274, 2008
منابع مشابه
Rigidity-Theoretic Constructions of Integral Fary Embeddings
Fáry [3] proved that all planar graphs can be drawn in the plane using only straight line segments. Harborth et al. [7] ask whether or not there exists such a drawing where all edges have integer lengths, and Geelen et al. [4] proved that cubic planar graphs satisfied this conjecture. We re-prove their result using rigidity theory, exhibit other natural families of planar graphs that satisfy th...
متن کاملDrawing some 4-regular planar graphs with integer edge lengths
A classic result of Fáry states that every planar graph can be drawn in the plane without crossings using only straight line segments. Harborth et al. conjecture that every planar graph has such a drawing where every edge length is integral. Biedl proves that every planar graph of maximum degree 4 that is not 4-regular has such a straight-line embedding, but the techniques are insufficient for ...
متن کاملLabeling Subgraph Embeddings and Cordiality of Graphs
Let $G$ be a graph with vertex set $V(G)$ and edge set $E(G)$, a vertex labeling $f : V(G)rightarrow mathbb{Z}_2$ induces an edge labeling $ f^{+} : E(G)rightarrow mathbb{Z}_2$ defined by $f^{+}(xy) = f(x) + f(y)$, for each edge $ xyin E(G)$. For each $i in mathbb{Z}_2$, let $ v_{f}(i)=|{u in V(G) : f(u) = i}|$ and $e_{f^+}(i)=|{xyin E(G) : f^{+}(xy) = i}|$. A vertex labeling $f$ of a graph $G...
متن کاملGraph Drawings with Relative Edge Length Specifications
We study plane straight-line embeddings of graphs where certain edges are specified to be longer than other edges. We analyze which graphs are universal in the sense that they allow a plane embedding for any total, strict order on the edge lengths. In addition, we also briefly consider circular arc drawings with relative edge length specifications.
متن کاملDrawing some planar graphs with integer edge-lengths
In this paper, we study drawings of planar graphs such that all edge lengths are integers. It was known that such drawings exist for all planar graphs with maximum degree 3. We give a different proof of this result, which is based on a simple transformation of hexagonal drawings as created by Kant. Moreover, if the graph is 3-connected then the vertices have integer coordinates that are in O(n)...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Graph Theory
دوره 58 شماره
صفحات -
تاریخ انتشار 2008